\section{Conclusion}\label{sec:conclusion}
%need to put conclusion here
We present a near-optimal distributed algorithm for random walk sampling in networks.
Our algorithm is essentially optimal (up to poly-logarithmic factors) with respect to both message and round complexity. We also present extensive simulations of our algorithm on various network topologies.
Since node sampling is useful in various networking applications,
our algorithms can serve as a building block in a variety of distributed networking applications. 

